DRM Algorithm for Irregular 2D Mesh
نویسندگان
چکیده
In this paper, routing algorithm has been mainly studied. The main work and contribution have been generalized as follows: Through the research of Internet and NoC’s (Network on Chip) deterministic and adaptive routing, DRM (Dynamic Routing Mesh) algorithm which is combined deterministic and adaptive routing algorithm has been designed, which not only ensures connectivity of any couple of communication nodes but also just requires only two virtual channels. Furthermore, the DRM routing algorithm is for solving the irregular 2D mesh topology, and the method has been designed which is used for the choice of path. Simulation results show that, DRM routing algorithm compares with Boppana and Virtual Network algorithm has certain performance advantages. Copyright © 2013 IFSA.
منابع مشابه
Power and Latency Optimized Deadlock-Free Routing Algorithm on Irregular 2D Mesh NoC using LBDRe
Efficient routing is challenging and crucial problem in the irregular mesh NoC topologies because of increasing hardware cost and routing tables. In this paper, the authors propose an efficient deadlock-free routing algorithm for irregular mesh NoCs which reduces the latency and power consumption significantly. The problem with degree priority based routing algorithm is that it cannot remove de...
متن کاملRow/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کامل2D Parallel Constrained Delaunay Mesh Generation: A Multigrain Approach on Deep Multiprocessors
Parallel Constrained Delaunay Mesh (PCDM) is a 2D adaptive and irregular meshing algorithm. In PCDM one can explore concurrency using three different levels of granularity: (i) coarse-grain at the sub-mesh level, (ii) medium-grain at the cavity level and (iii) fine-grain at the element level. The mediumand fine-grain approaches can be used to improve the single-processor performance of coarse-g...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملNotes On Mesh Parametrization
Parameterization has lots of applications in computer graphics such as texture mapping, remeshing and morphing. Texture mapping a 2D image onto a 3D mesh would previously cost lots of efforts and time for an experienced modeler to tweak the u,v texture coordinates of the mesh. By parameterizing the mesh onto a rectangular 2D domain, this becomes an easy task of mapping a 2D image onto an rectan...
متن کامل